A Fast Start-up and Scalable Algorithm for Continuous Media Servers
نویسنده
چکیده
. Summary In this paper, we propose a novel VOD server architecture and a dynamic prefetch buffer allocation algorithm based on popularity. This can drastically improve the maximum number of streams a drive can support, with a small startup latencies. The primary design goal is to guarantee glitch free operation for maximum number of users. Detailed simulation is carried out and compared with the performance parameters of the static allocation algorithm.
منابع مشابه
PASTENSE: a Fast Start-up Algorithm for Scalable Video Libraries
Striping video clip data over many physical resources (typically disk drives) balances video server load with less data replication. Current striped video delivery algorithms can have high start-up latency if the load is high. We propose a new, fast start-up algorithm, PASTENSE. This algorithm minimizes start-up latency by using aggressive prefetching to exploit disk idle time, and using availa...
متن کاملPASTENSE: a Fast Start-up Algorithm for Scalable Video Libraries (CMU-CS-01-105)
Striping video clip data over many physical resources (typically disk drives) balances video server load with less data replication. Current striped video delivery algorithms can have high start-up latency if the load is high. We propose a new, fast start-up algorithm, PASTENSE. This algorithm minimizes start-up latency by using aggressive prefetching to exploit disk idle time, and using availa...
متن کاملStriping Doesn't Scale: How to Achieve Scalability for Continuous Media Servers with Replication
Multimedia applications place high demands for QoS, performance, and reliability on storage servers and communication networks. These, often stringent, requirements make design of cost-e ective and scalable continuous media (CM) servers di cult. In particular, the choice of data placement techniques can have a signi cant e ect on the scalability of the CM server and its ability to utilize resou...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملOn Minimizing Startup Latency in Scalable Continuous Media Servers
In a scalable server that supports the retrieval and display of continuous media audio and video clips both the number of simultaneous displays and the expected startup latency of a dis play increases as a function of additional disk bandwidth This paper describes object replication and request migration as two alternative techniques to minimize startup latency In addition to developing analyti...
متن کامل